The Bakery Protocol : A Comparative Case - Study in Formal Veri cationW
نویسنده
چکیده
REPORTRAPPORT The bakery protocol: a comparative case-study in formal verification Abstract Groote and the second author veriied (a version of) the Bakery Protocol in CRL. Their process-algebraic veriication is rather complex compared to the protocol. Now the question is: How do other veriication techniques perform on this protocol? In this paper, we present a new correctness proof by using I/O-automata theory and discuss the relative merits of both approaches.
منابع مشابه
Formal Speci cation and Veri cation of Mobile Agent Data Integrity Properties: a Case Study
The aim of the work presented in this paper is to check cryptographic protocols for mobile agents against both network intruders and malicious hosts using formal methods. We focus attention on data integrity properties and show how the techniques used for classical message-based protocols such as authentication protocols can be applied to mobile agent systems as well. To illustrate our approach...
متن کاملVeri cation of SDL Speci cations on the Basis of Stream Semantics
This paper presents a new approach to the formal veri cation of SDL speci cations SDL is given de notational semantics based on the concepts of streams and stream processing functions in the formal framework of Focus The formalization of SDL revealed some aspects of SDL which are handled un precisely in the Z e g the concept of time and gives a solution to them The formal semantics is the start...
متن کاملClassi cation of Dependable Real-time Protocols : A Formal-Methods Perspective for Validation
Computers used for critical applications utilize dependable and real-time protocols to deliver reliable and timely services. The inherently large state-space covered by these protocols limits the e ectiveness of the conventional veri cation and validation (V&V) techniques. A commonly used validation technique is that of fault injection (FI). Although a wide variety of techniques and tools exist...
متن کاملFighting Livelock in the i-Protocol: A Comparative Study of Veri cation Tools
The i-protocol, an optimized sliding-window protocol for GNU UUCP, came to our attention two years ago when we used the Concurrency Factory's local model checker to detect, locate, and correct a non-trivial livelock in version 1.04 of the protocol. Since then, we have repeated this veri cation e ort with ve widely used model checkers, namely, COSPAN, Mur', SMV, Spin, and XMC. It is our contenti...
متن کاملFormal Veri cation of Standards for Distance Vector Routing Protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks. We develop veri cation techniques suited to routin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995